Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
نویسندگان
چکیده
منابع مشابه
Fixed points of Boolean networks, guessing graphs, and coding theory
In this paper, we are interested in the number of fixed points of functions f : An → An over a finite alphabet A defined on a given signed digraph D. We first use techniques from network coding to derive some lower bounds on the number of fixed points that only depends on D. We then discover relationships between the number of fixed points of f and problems in coding theory, especially the desi...
متن کاملFrom kernels in directed graphs to fixed points and negative cycles in Boolean networks
We consider a class of Boolean networks called and-nets, and we address the question of whether the absence of negative cycle in local interaction graphs implies the existence of a fixed point. By defining correspondences with the notion of kernel in directed graphs, we prove a particular case of this question, and at the same time, we prove new theorems in kernel theory, on the existence and u...
متن کاملLocal negative circuits and fixed points in Boolean networks
To each Boolean function F : {0, 1} → {0, 1} and each point x ∈ {0, 1}, we associate the signed directed graph GF (x) of order n that contains a positive (resp. negative) arc from j to i if the discrete analogue of (∂fi/∂xj)(x) is positive (resp. negative). We then focus on the following open problem: Is the absence of a negative circuit in GF (x) for all x ∈ {0, 1} a sufficient condition for F...
متن کاملNumber of fixed points and disjoint cycles in monotone Boolean networks
Given a digraph G, a lot of attention has been deserved on the maximum number φ(G) of fixed points in a Boolean network f : {0, 1} → {0, 1} with G as interaction graph. In particular, a central problem in network coding consists in studying the optimality of the classical upper bound φ(G) ≤ 2 , where τ is the minimum size of a feedback vertex set of G. In this paper, we study the maximum number...
متن کاملFixed points and connexions between positive and negative cycles in Boolean networks
We are interested in the relationships between the number of fixed points in a Boolean network f : {0, 1}n → {0, 1}n and its interaction graph G, which is the signed digraph on {1, . . . , n} that describes the positive and negative influences between the components of the network. A fundamental theorem of Aracena, suggested by the biologist Thomas, says that if G has no positive (resp. negativ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140988358